#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
struct Node {
  int t, val;
};
list<Node> tickets;

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  ll cost = 0;
  rep(i, 1, n) {
    int x, p, t;
    cin >> x >> p >> t;
    if (x == 0) {
      cost += p;
      tickets.push_back(Node{t, p});
    } else {
      while (tickets.size() && tickets.front().t + 45 < t) tickets.pop_front();
      for (auto it = tickets.begin(); it != tickets.end(); it++) {
        if (it->val >= p) {
          p = 0;
          tickets.erase(it);
          break;
        }
      }
      cost += p;
    }
  }
  cout << cost;
  return 0;
}